Wireless sensor networks (WSNs) consist of thousands of small nodes. The small and inexpensive parts of these nodes have led to their widespread use in various fields. However, these networks have constraints on energy consumption, processing resources, and storage whic
More
Wireless sensor networks (WSNs) consist of thousands of small nodes. The small and inexpensive parts of these nodes have led to their widespread use in various fields. However, these networks have constraints on energy consumption, processing resources, and storage which have caused many studies to find solutions to reduce these constraints. In recent years, with the advent of the concept of Fog computing, many new and effective solutions are represented for routing in wireless sensor networks. Since in WSNs it is important to save alive nodes and reduce the energy consumption of nodes, fog computing is useful for this purpose. In most WSN routing protocols, the best way to send data to cluster heads and the base station is the major part of their studies. In the new protocols, the Fog computing have been used to find the best way. In these methods, we have seen decreasing energy consumption and increasing network lifetime. In this paper, we represent a fog-based algorithm for routing in WSNs. According to the simulation results, the proposed protocol improved energy consumption by 9% meanwhile the number of alive nodes is increased by 74%, compared to the reviewed method.
Manuscript profile
